Decomposing infinite graphs
نویسندگان
چکیده
منابع مشابه
Decomposing infinite graphs
In his classic paper Über eine Eigenschaft der ebenen Komplexe, Wagner [ 19 ] tackles the following problem. Kuratowski’s theorem, in its excluded minor version, states that a finite graph is planar if and only if it has no minor isomorphic to K5 or to K3,3. (A minor of G is any graph obtained from some H ⊂ G by contracting connected subgraphs.) If we exclude only one of these two minors, the g...
متن کاملDecomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960’s, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte’s decomposition to include all infinite 2-connected graphs.
متن کاملDecomposing plane cubic graphs
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture for 3-connected cubic plane graphs and 3-connected cubic graphs on the projective plane. Our proof provides a polynomial time algorithm to find the decomposition for 3-connected cubic plane graphs.
متن کاملDecomposing Graphs with Symmetries
While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.
متن کاملDecomposing Weighted Graphs
We solve the following problem: Can an undirected weighted graph G be partitioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible for all constraints a(x), b(x) satisfying dG(x) ≥ a(x) + b(x) + 2WG(x), for every vertex x, where dG(x),WG(x) are, respectively, the sum and maximum of inciden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90330-5